package coherence;
import java.util.List;
import multiarray.MultiArray;


public class CoherenceInputsFromConflict {

	//structures by cross-section representation
	
	public MultiArray<MultiArray<Float>> altruisms;				//altruism that each cross-section
														//has for every other cross-section
	public MultiArray<Float> powerByCrossSection;	//power for each cross-section
	public MultiArray<Float> populationByCrossSection;	//power for each cross-section	
	public List<List<int []>> partition;						//the partition along which conflict occurred
	
	//these are structures that do not contain the m-dimensional structure of a population
	//they do not treat coalition elements as cross-sections but as abstract agents
	
	public float[][] theta_i_j;		//resource allocation at the coalition level
	//public float[][] v_i_j;			//state of the world variable drawn from U[0,1]
	//public float[][] psi_i_j;			//a-priori probability of i winning over j
	public boolean[][] won_i_j;			//did i beat j?		
	
	public boolean validate(){
		return(altruisms!= null && 
			powerByCrossSection != null &&
			partition != null &&
			populationByCrossSection != null
			//&&
			//theta_i_j != null &&
			//v_i_j != null && psi_i_j != null	
		);
	}	
	
}
